Proposed Algorithm Simple Indirect Algorithm

نویسنده

  • V. K. Prasanna
چکیده

\Implementation of !-k synthetic aperture radar imaging algorithm on a massively parallel supercomputer," SPIE Figure 9: Comparison of the simple indirect algorithm and the proposed algorithm application, the application can be divided into several stages and the computational requirements of the stages vary. Thus, in each stage, diierent number of processors are used. The M-toN communication algorithm is used between any two consecutive stages. Such processing arises in applications such as ATR, SAR, STAP, and Sonar. and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon. The experimental results were obtained at the Maui High Performance Computing Center (MHPCC) and at the San Diego Supercomputer Center(SDSC). 13 the second group, respectively. The previous algorithm needed MN communication steps. By using the proposed algorithms, the number of processors required to perform 1K 1K FFT was reduced by up to 50%. The maximum data size that could be processed was also increased by using our algorithm. The proposed M-toN communication algorithms can be used in applications that have heterogeneous computational characteristics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image Segmentation using Improved Imperialist Competitive Algorithm and a Simple Post-processing

Image segmentation is a fundamental step in many of image processing applications. In most cases the image’s pixels are clustered only based on the pixels’ intensity or color information and neither spatial nor neighborhood information of pixels is used in the clustering process. Considering the importance of including spatial information of pixels which improves the quality of image segmentati...

متن کامل

Design and Experimental Evaluation of integrated orientation estimation algorithm Autonomous Underwater Vehicle Based on Indirect Complementary Filter

This paper aims is to design an integrated navigation system constituted by low-cost inertial sensors to estimate the orientation of an Autonomous Underwater Vehicle (AUV) during all phases of under water and surface missions. The proposed approach relied on global positioning system, inertial measurement unit (accelerometer & rate gyro), magnetometer and complementary filter technique. Complem...

متن کامل

A simple algorithm for solving the Volterra integral equation featuring a weakly singular kernel

There are many methods for numerical solutions of integral equations. In various branches of science and engineering, chemistry and biology, and physics applications integral equation is provided by many other authors. In this paper, a simple numerical method using a fuzzy, for the numerical solution of the integral equation with the weak singular kernel is provided. Finally, by providing three...

متن کامل

برآورد پارامترهای معادله ماسکینگام غیرخطی در مدل روندیابی سیلاب با استفاده از الگوریتم چرخه آب

Flood routing in river is one of important issues in water engineering projects. Hydraulic routing is common in especially in river that has branches and river that have not basin information. So as to need obtain cross section and slops in all interval of river that Muskingum helps by saving time and cost. In this paper, a Water Cycle Algorithm (WCA) is proposed for the parameter estimation of...

متن کامل

Genetic algorithm for Echo cancelling

In this paper, echo cancellation is done using genetic algorithm (GA). The genetic algorithm is implemented by two kinds of crossovers; heuristic and microbial. A new procedure is proposed to estimate the coefficients of adaptive filters used in echo cancellation with combination of the GA with Least-Mean-Square (LMS) method. The results are compared for various values of LMS step size and diff...

متن کامل

A Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS

Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997